考虑完全拆分的拣选分批与拣选路径集成优化模型

在电商海量订单背景下,在线订单拣选作业难度加大,因此设计了基于订单完全拆分的拣选分批与拣选路径综合优化模型解决此问题.模型共分两阶段.第一阶段,基于种子算法,设计考虑订单完成度、等待时间与拣选路径的拣选分批模型;第二阶段以拣选单流为单队列,设计多拣选员并行服务的拣选系统.行走策略为基于返回型和遍历型的综合策略,拣选路径优化模型采用模拟退火算法求解.算例分析表明,与传统的不拆分拣选分批模型相比,构建的综合优化模型能够显著提高拣选系统效率.拣选员为4人时,模型能够使总服务时间减少58.79%,订单完成率提高10.09%.     

Removal of carbonyl sulfide from CO2 stream using AgNO3-modified NaZSM-5

Removal of carbonyl sulfide (COS) from CO₂ stream is significant for the production and utilization of food grade CO₂. This study investigates the adsorption performance of Ag/NaZSM-5 as adsorbent prepared by incipient wetness impregnation for the removal of COS from a CO₂ stream in a fixed-bed adsorption apparatus. Effects of various conditions on the preparation of adsorbent, adsorption and desorption were intensively examined. The results revealed that COS can be removed to below 1×10^?9 from a CO₂ stream (1000 ppm COS/CO₂) using Ag/NaZSM-5 (10 wt% AgNO₃) with an adsorption capacity of 12.86 mg-g^?1. The adsorbent can be fully regenerated using hot air at 450 °C. The adsorption ability remained stable even after eight cycles of regeneration.     

完全非正规Toeplitz算子

In this paper, we show that the hyponormal Toeplitz operator Tφ with trigonometric polynomial symbol φ is either normal or completely non-normal. Moreover, if Tφ is non-normal, then Tφ has a dense set of cyclic vectors. Some general conditions are also considered.     

带有全铰节点的三维杆系结构静力分析的回传波射矩阵法研究

推导出含有全铰节点的三维杆系结构的回传波射矩阵表达式,完善了具有任意连接和约束的空间杆系结构静力分析的回传波矩阵法.基于节点平衡方程和协调方程,推导出表达杆件近端位移和远端位移关系的传递分配矩阵及载荷源向量,并通过由对偶坐标系下近端位移和远端位移的关系获得结构的总体相位矩阵,再引入转列矩阵,进而推导出结构的回传波射矩阵,在此基础上求解以杆端位移为基本未知量的线性方程组,最终得到精确确定所有杆件的杆端位移及杆端内力的矩阵列式.给出了空间杆系结构算例分析,与有限元结果比较,验证了回传波射矩阵法的计算精度.     

On α-Limit Sets in Lorenz Maps

The aim of this paper is to show that α-limit sets in Lorenz maps do not have to be completely invariant. This highlights unexpected dynamical behavior in these maps, showing gaps existing in the literature. Similar result is obtained for unimodal maps on [0,1]. On the basis of provided examples, we also present how the performed study on the structure of α-limit sets is closely connected with the calculation of the topological entropy.     

Computing the Topological Entropy for Piecewise Monotonic Maps on the Interval

A new method for computing the topological entropy of a piecewise monotonic transformation on the interval is presented. It uses a transition matrix associated with the transformation. For this matrix we give a spectral theorem. This can be used for an estimation of the accuracy of the algorithm.     

Alternatingly Hyperexpansive Operator Tuples

The notion of an alternatingly hyperexpansive operator on a Hilbert space is generalized to that of an alternatingly hyperexpansive operator tuple, which necessitates exploring the theory of absolutely monotone functions as defined on the m-fold product N ^m of the semi-group N of non-negative integers and as defined on semi-open cubes in the m-dimensional real Euclidean space R ^m. The multi-variable Laplace transform and the Stieltjes Moment Problem make a natural appearance in the development of the relevant theory, which also highlights the close connections of alternatingly hyperexpansive operator tuples with completely hyperexpansive and subnormal ones. In particular, if T is subnormal and the joint (Taylor) spectrum of its minimal normal extension is contained in a certain subset of the Hermitian space C ^m, then T turns out to be alternatingly hyperexpansive. In the context of multi-variable weighted shifts, the last assertion can be related to the notion of a Stieltjes Moment Net. The general characterization of an alternatingly hyperexpansive m-variable weighted shift T, however, requires a certain net of (positive) numbers associated with T to be absolutely monotone on N ^m and allows for such a T to be non-subnormal.     

A matricial extension of the Helson-Sarason theorem and a characterization of some multivariate linearly completely regular processes

We generalize the theorems of Helson-Szegö and Helson-Sarason for matricial measures. We study two-weighted inequalities for the Hilbert transform in [0, 2π] and in R and give a characterization for the positivity of the angle between past and future of multivariate weakly stationary stochastic processes, in the discrete and the continuous case. We also characterize the multivariate weakly stationary stochastic processes that are linearly completely regular and study the rate of convergence of the maximal correlation coefficient.     

Scalarization of vector optimization problems

In this paper, we investigate the scalar representation of vector optimization problems in close connection with monotonic functions. We show that it is possible to construct linear, convex, and quasiconvex representations for linear, convex, and quasiconvex vector problems, respectively. Moreover, for finding all the optimal solutions of a vector problem, it suffices to solve certain scalar representations only. The question of the continuous dependence of the solution set upon the initial vector problems and monotonic functions is also discussed.The author is grateful to the two referees for many valuable comments and suggestions which led to major imporvements of the paper.     

单调函数的列表判别法

本文讨论了单调函数和函数的最小列表，在此基础上提出单调函数、单调递增函数和单调递减函的列表判别方法，并举例说明了判别过程。